Domain decomposition based parallel Howard’s algorithm
نویسندگان
چکیده
منابع مشابه
Domain Decomposition Based High Performance Parallel Computing
The study deals with the parallelization of finite element based Navier-Stokes codes using domain decomposition and state-ofart sparse direct solvers. There has been significant improvement in the performance of sparse direct solvers. Parallel sparse direct solvers are not found to exhibit good scalability. Hence, the parallelization of sparse direct solvers is done using domain decomposition t...
متن کاملParallel Implementation of a Schwarz Domain Decomposition Algorithm
We describe and compare some recent domain decomposition algorithms of Schwarz type with respect to parallel performance. A new, robust domain decomposition algorithm { Additive Average Schwarz is compared with a classical overlapping Schwarz code. Complexity estimates are given in both two and three dimensions and actual implementations are compared on a Paragon machine as well as on a cluster...
متن کاملParallel Performance Investigation of a Domain Decomposition Algorithm
where Ω is the spatial domain and ∂Ω is the boundary of Ω, are widely used in science and engineering as mathematical models for computational simulations, such as in oil reservoir simulations, analysis of flow field around airplanes, transport of solutes in groundwater, and global weather prediction. In particular, when β = 0, equation (1) becomes a pure convection equation. For large-scale pr...
متن کاملA Domain Decomposition for a Parallel Adaptive Meshing Algorithm
We describe a domain decomposition algorithm for use in the parallel adaptive meshing paradigm of Bank and Holst. Our algorithm has low communication , makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. Numerical examples illustrate the effectiveness of the procedure. In [4, 5], we introduced a gene...
متن کاملParallel Subdomain-based Preconditioner for Non-overlapping Domain Decomposition Methods Parallel Subdomain-based Preconditioner for Non-overlapping Domain Decomposition Methods
We present a new parallelizable preconditioner that is used as the local component for a two-level preconditioner similar to BPS. On 2D model problems that exhibit either high anisotropy or discontinuity, we demonstrate its attracting numerical behaviour and compare it to the regular BPS. Finally, to alleviate the construction cost of this new preconditioner, that requires the explicit computat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics and Computers in Simulation
سال: 2018
ISSN: 0378-4754
DOI: 10.1016/j.matcom.2017.04.008